Operational Analysis of Queues with General Service Times
نویسندگان
چکیده
Formulas relating the mean queue length, utilization, and coefficient of variation of service time of a queue during a given observation period are derived using operational analysis. The main formula, a counterpart of the Pollaczek-Khintchin formula for M/G/l queues, relies on four homogeneity assumptions. The other formulas require fewer assumptions. Simulation experiments compare the robustness of these estimators against the stochastic Pollaczekkhintchin formula. ~ Words and Phrases; operational analysis, M/G/l queue, mean queue length, PollaczekKhintchin formula. This work was supported in part by NSF grant MCS78-01729 at Purdue university.
منابع مشابه
Many-server Queues with Customer Abandonment: a Survey of Diffusion and Fluid Approximations
The performance of a call center is sensitive to customer abandonment. In this survey paper, we focus on / / G GI n GI parallel-server queues that serve as a building block to model call center operations. Such a queue has a general arrival process (the G ), independent and identically distributed (iid) service times with a general distribution (the first GI ), and iid patience times with a g...
متن کاملSOME GENERALIZATIONS OF WEAK CONVERGENCE RESULTS ON MULTIPLE CHANNEL QUEUES IN HEAVY TRAFFIC.
This paper extends certain results of Iglehart and Whitt on multiple channel queues to the case where the inter-arrival times and service times are not necessarily identically distributed. It is shown that the weak convergence results in this case are exactly the same as those obtained by Iglehart and Whitt
متن کاملApproximate analysis of non-stationary loss queues and networks of loss queues with general service time distributions
Article history: Received 7 June 2010 Accepted 13 March 2011 Available online 21 March 2011
متن کاملA Mathematical Analysis on Linkage of a Network of Queues with Two Machines in a Flow Shop including Transportation Time
This paper represents linkage network of queues consisting of biserial and parallel servers linked to a common server in series with a flowshop scheduling system consisting of two machines. The significant transportation time of the jobs from one machine to another is also considered. Further, the completion time of jobs/customers (waiting time + service time) in the queue network is the set...
متن کاملServer allocation for zero buffer tandem queues
In this paper we consider the problem of allocating servers to maximize throughput for tandem queues with no buffers. We propose an allocation method that assigns servers to stations based on the mean service times and the current number of servers assigned to each station. A number of simulations are run on different configurations to refine and verify the algorithm. The algorithm is proposed ...
متن کامل